48 research outputs found

    Structural recursion for querying ordered graphs

    Full text link

    MAPLE preparation and characterization of mixed arylenevinylene based oligomers:C60 layers

    Get PDF
    This paper presents some studies about the preparation by matrix-assisted pulsed laser evaporation (MAPLE) of mixed layers based on two arylenevinylene oligomers, 1,4-bis [4-(N,N′-diphenylamino)phenylvinyl] benzene (L78) and 3,3′-bis(N-hexylcarbazole)vinylbenzene (L13) as donor and buckminsterfullerene (C60) as acceptor, blended in three different weight ratios: 1:1, 1:2 and 1:3. The optical, morphological, structural and electrical properties of these mixed layers have been investigated emphasizing the effect of the layer composition and of the significant degree of disorder. I–V characteristics have revealed typically solar cell behaviour for the heterostructures prepared with mixed layers containing L78 (L13) and fullerene blended in a weight ratio of 1:2. The solar cell structure glass/ITO/L13:C60/Al has shown the best parameters

    Naturally Embedded Query Languages

    Get PDF
    We investigate the properties of a simple programming language whose main computational engine is structural recursion on sets. We describe a progression of sublanguages in this paradigm that (1) have increasing expressive power, and (2) illustrate robust conceptual restrictions thus exhibiting interesting additional properties. These properties suggest that we consider our sublanguages as candidates for "query languages". Viewing query languages as restrictions of our more general programming language has several advantages. First, there is no "impedance mismatch" problem; the query languages are already there, so they share common semantic foundation with the general language. Second, we suggest a uniform characterization of nested relational and complex-object algebras in terms of some surprisingly simple operators; and we can make comparisons of expressiveness in a general framework. Third, we exhibit differences in expressive power that are not always based on complexity arguments..
    corecore